441 research outputs found

    Low-level processing for real-time image analysis

    Get PDF
    A system that detects object outlines in television images in real time is described. A high-speed pipeline processor transforms the raw image into an edge map and a microprocessor, which is integrated into the system, clusters the edges, and represents them as chain codes. Image statistics, useful for higher level tasks such as pattern recognition, are computed by the microprocessor. Peak intensity and peak gradient values are extracted within a programmable window and are used for iris and focus control. The algorithms implemented in hardware and the pipeline processor architecture are described. The strategy for partitioning functions in the pipeline was chosen to make the implementation modular. The microprocessor interface allows flexible and adaptive control of the feature extraction process. The software algorithms for clustering edge segments, creating chain codes, and computing image statistics are also discussed. A strategy for real time image analysis that uses this system is given

    Computing region moments from boundary representations

    Get PDF
    The class of all possible formulas for computing arbitrary moments of a region from the region's boundary is derived. The selection of a particular formula depends on the choice of an independent parameter. Several choices of this parameter are explored for region boundaries approximated by polygons. The parameter choice that minimizes computation time for boundaries represented by chain code is derived. Algorithms are presented for computing arbitrary moments for a region from a polygonal approximation of its boundary and for computing low order moments from chain encoded boundaries

    First Evidence for Wollemi Pine-type Pollen (Dilwynites: Araucariaceae) in South America

    Get PDF
    We report the first fossil pollen from South America of the lineage that includes the recently discovered, extremely rare Australian Wollemi Pine, Wollemia nobilis (Araucariaceae). The grains are from the late Paleocene to early middle Eocene Ligorio Márquez Formation of Santa Cruz, Patagonia, Argentina, and are assigned to Dilwynites, the fossil pollen type that closely resembles the pollen of modern Wollemia and some species of its Australasian sister genus, Agathis. Dilwynites was formerly known only from Australia, New Zealand, and East Antarctica. The Patagonian Dilwynites occurs with several taxa of Podocarpaceae and a diverse range of cryptogams and angiosperms, but not Nothofagus. The fossils greatly extend the known geographic range of Dilwynites and provide important new evidence for the Antarctic region as an early Paleogene portal for biotic interchange between Australasia and South America.Facultad de Ciencias Naturales y Muse

    Carbon Isotope Compositions of Terrestrial C3 Plants as Indicators of (Paleo)Ecology and (Paleo)Climate

    Get PDF
    A broad compilation of modern carbon isotope compositions in all C3 plant types shows a monotonic increase in δ13C with decreasing mean annual precipitation (MAP) that differs from previous models. Corrections for temperature, altitude, or latitude are smaller than previously estimated. As corrected for altitude, latitude, and the δ13C of atmospheric CO2, these data permit refined interpretation of MAP, paleodiet, and paleoecology of ecosystems dominated by C3 plants, either prior to 7–8 million years ago (Ma), or more recently at mid- to high latitudes. Twenty-nine published paleontological studies suggest preservational or scientific bias toward dry ecosystems, although wet ecosystems are also represented. Unambiguous isotopic evidence for C4 plants is lacking prior to 7–8 Ma, and hominid ecosystems at 4.4 Ma show no isotopic evidence for dense forests. Consideration of global plant biomass indicates that average δ13C of C3 plants is commonly overestimated by approximately 2‰

    Optimization in task--completion networks

    Full text link
    We discuss the collective behavior of a network of individuals that receive, process and forward to each other tasks. Given costs they store those tasks in buffers, choosing optimally the frequency at which to check and process the buffer. The individual optimizing strategy of each node determines the aggregate behavior of the network. We find that, under general assumptions, the whole system exhibits coexistence of equilibria and hysteresis.Comment: 18 pages, 3 figures, submitted to JSTA

    Combinatorics and Boson normal ordering: A gentle introduction

    Full text link
    We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick's theorem. The methodology can be straightforwardly generalized from the simple example given herein to a wide class of operators.Comment: 8 pages, 1 figur

    Network robustness and fragility: Percolation on random graphs

    Full text link
    Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process, but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real world networks, which often possess power-law or other highly skewed degree distributions. In this paper we study percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolation, bond percolation, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understanding of network resilience.Comment: 4 pages, 2 figure

    Entropy calculation for a toy black hole

    Full text link
    In this note we carry out the counting of states for a black hole in loop quantum gravity, however assuming an equidistant area spectrum. We find that this toy-model is exactly solvable, and we show that its behavior is very similar to that of the correct model. Thus this toy-model can be used as a nice and simplifying `laboratory' for questions about the full theory.Comment: 18 pages, 4 figures. v2: Corrected mistake in bibliography, added appendix with further result

    Dobinski-type relations and the Log-normal distribution

    Full text link
    We consider sequences of generalized Bell numbers B(n), n=0,1,... for which there exist Dobinski-type summation formulas; that is, where B(n) is represented as an infinite sum over k of terms P(k)^n/D(k). These include the standard Bell numbers and their generalizations appearing in the normal ordering of powers of boson monomials, as well as variants of the "ordered" Bell numbers. For any such B we demonstrate that every positive integral power of B(m(n)), where m(n) is a quadratic function of n with positive integral coefficients, is the n-th moment of a positive function on the positive real axis, given by a weighted infinite sum of log-normal distributions.Comment: 7 pages, 2 Figure

    Heterogeneous Bond Percolation on Multitype Networks with an Application to Epidemic Dynamics

    Get PDF
    Considerable attention has been paid, in recent years, to the use of networks in modeling complex real-world systems. Among the many dynamical processes involving networks, propagation processes -- in which final state can be obtained by studying the underlying network percolation properties -- have raised formidable interest. In this paper, we present a bond percolation model of multitype networks with an arbitrary joint degree distribution that allows heterogeneity in the edge occupation probability. As previously demonstrated, the multitype approach allows many non-trivial mixing patterns such as assortativity and clustering between nodes. We derive a number of useful statistical properties of multitype networks as well as a general phase transition criterion. We also demonstrate that a number of previous models based on probability generating functions are special cases of the proposed formalism. We further show that the multitype approach, by naturally allowing heterogeneity in the bond occupation probability, overcomes some of the correlation issues encountered by previous models. We illustrate this point in the context of contact network epidemiology.Comment: 10 pages, 5 figures. Minor modifications were made in figures 3, 4 and 5 and in the text. Explanations and references were adde
    • …
    corecore